Using Scoping Rules as a Distributed Coordination Language
نویسنده
چکیده
Keywords: coordination languages, Scheme, distributed systems, lexical scoping, distributed objects. Essential to coordinating a distributed application is organizing and traversing the distributed application graph. Lexical scoping performs this function among modern high-level programming languages, but does not have the same distinction in distributed programming systems, where it competes with various forms of associative and object-oriented binding. We will show that distributed lexical scop-ing, combined with closures, provides a powerful means of coordinating communication in distributed computations and can significantly reduce the complexity for developing certain types of applications visa -vis other coordination paradigms/languages. These results are not dependent on a particular programming language, and can be combined with existing paradigms.
منابع مشابه
Linkable Coordination Artifacts for Inter-Organisational Workflow
Inter-organisational workflow (IOW) is a natural scenario for MAS (multiagent system) technologies. In particular, MAS coordination infrastructures can work as a general-purpose support for WfMSs (workflow management systems): coordination artifacts can be specialised as workflow engines, encapsulating workflow rules expressed in terms of coordination laws. A network of inter-connected coordina...
متن کاملThe Coordination Language Facility: Coordination of Distributed Objects
The development of communication infrastructures and the rapid growth of networking facilities in information technologies increase information mobility and the decentralisation of work processes in industry and services. This evolution leads to increasing demands on the coordination of information systems. However, information technologies available today are capable of supporting only interop...
متن کاملIsolating untrusted software extensions by custom scoping rules
In a modern programming language, scoping rules determine the visibility of names in various regions of a program [15]. In this work, we examine the idea of allowing an application developer to customize the scoping rules of its underlying language. We demonstrate that such an ability can serve as the cornerstone of a security architecture for dynamically extensible systems. A run-time module s...
متن کاملInferring Scope through Syntactic Sugar (Extended Version)
Many languages use syntactic sugar to define parts of their surface language in terms of a smaller core. Thus some properties of the surface language, like its scoping rules, are not immediately evident. Nevertheless, ides, refactorers, and other tools that traffic in source code depend on these rules to present information to users and to soundly perform their operations. In this paper, we sho...
متن کاملUsing Many-sorted Inference Rules to Generate Semantic Analysis
We introduce a speciication language that can be used to specify semantic analysis as well as intermediate code generation. This speciication language deenes semantic properties by means of many-sorted inference rules. Type inference rules are just a one-sorted special case. We demonstrate that inference rules can also be used to infer other semantic information such as deenitions of identiiers...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997